ar X iv : q ua nt - p h / 05 06 01 5 v 1 2 Ju n 20 05 Reply To “ Comment on ‘ Quantum Convolutional Error - Correcting Codes ’ ”

Theorem 3. Let C1 be a classical (block or convolutional) code of rate r1 and distance d1 and let C2 be the [n2 = d2, 1, d2] majority vote classical code of rate r2, namely, the one that maps |t〉 to ⊗n2 j=1 |t〉. We construct a quantum code C by first encoding a quantum state by C1, then by applying a Hadamard transform to every resultant qubit, and finally by encoding each of the Hadamard transformed qubit by C2. The rate and minimum distance of code C equal r1r2 and min(d ⊥ 1 , d2) respectively, where d1 is the minimum distance of the (classical) dual code of C1.